Inference and Learning with Model Uncertainty in Probabilistic Logic Programs

نویسندگان

چکیده

An issue that has so far received only limited attention in probabilistic logic programming (PLP) is the modelling of so-called epistemic uncertainty, uncertainty about model itself. Accurately quantifying this paramount to robust inference, learning and ultimately decision making. We introduce BetaProbLog, a PLP language can uncertainty. BetaProbLog sound semantics, an effective inference algorithm combines Monte Carlo techniques with knowledge compilation, parameter algorithm. empirically outperform state-of-the-art methods on tasks second-order Bayesian networks, digit classification discriminative presence

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-Based Inference in Probabilistic Logic Programs

A wide variety of models that combine logical and statistical knowledge can be expressed succinctly in the Probabilistic Logic Programming (PLP) paradigm. Specifically, models in standard statistical formalisms such as probabilistic graphical models (PGMs) (e.g. Bayesian Networks), can be easily encoded as PLP programs. For instance, Fig. 1(a) shows a program in PRISM, a pioneering PLP language...

متن کامل

Abductive Inference in Probabilistic Logic Programs

Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behaviors of entities. Rules in ap-programs have the form “If the environment in which entity E operates satisfies certain conditions, then the probability that E will take some action A is between L and U”. Given an ap-program, we ...

متن کامل

Speeding Up Inference for Probabilistic Logic Programs

Probabilistic Logic Programming (PLP) allows to represent domains containing many entities connected by uncertain relations and has many applications in particular in Machine Learning. PITA is a PLP algorithm for computing the probability of queries that exploits tabling, answer subsumption and Binary Decision Diagrams (BDDs). PITA does not impose any restriction on the programs. Other algorith...

متن کامل

Inference in probabilistic logic programs with continuous random variables

Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, Raedt et al’s ProbLog and Vennekens et al’s LPAD, is aimed at combining statistical and logical knowledge representation and inference. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use ...

متن کامل

Lifted Inference for Probabilistic Logic Programs

First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics such as MLNs. For certain subsets of first-order logic, lifted model counters were shown to run in time polynomial in the number of objects in the domain of discourse, where propositional model counters require exponential time. However, these guarantees apply only...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2022

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v36i9.21245